Modified Multi-bit Flipping Decoding Algorithm for Low-density Parity-check Codes

Aiming at seeking a low complexity decoder of the low-density parity-check (LDPC) codes, we present one modified multi-bit flipping (MMBF) algorithm. For those LDPC codes whose parity check matrices have light column weight, both the bootstrap step and a novel delay-handling step are included in MMBF, based on one framework which is the combination of conventional PWBF and IWBF. On the other hand, for those LDPC codes, such as finite geometry (FG) LDPC codes with large column weight in their parity check matrices, the same strategy as that for light-column-weight LDPC codes is applicable except that the bootstrap is omitted from MMBF, since it is found in the simulation that the bootstrap may impact the error performance negatively. Despite it, the delay-handling step, which is implemented simply by delaying flipping those codeword bits with higher reliability values, demonstrates its merit consistently for both types of LDPC codes. Simulation result shows that the proposed MMBF could achieve the best performance/complexity tradeoff, in comparison to the existing multi-bit flipping algorithms.